#include <iostream>

#include "unorderedMap.h"
#include "unorderedSet.h"

// #include"test.h"
using namespace std;

void test1() {
  MyHash::unordered_set<int> s1;
  int a[] = {12, 23, 44, 67, 10, 66, 89};
  for (auto e : a) {
    s1.insert(e);
  }

//   auto it = s1.begin();
//   ++it;
//   cout << *it << endl;

for(auto &it: s1){
  cout << it << " ";
}
cout << endl;
}

void unordered_Test1() {
  int arr[] = {34, 66, 78, 99, 168, 343, 218, 666, 12, 44};

  MyHash::unordered_map<int, int> m1;

  for (auto &it : arr) {
    m1[it]++;
//     m1.insert({it, it});
  }

for(auto &it:m1){
  cout << it.first << " : " << it.second << " " << endl;
}
}

int main() {
  //   cout << "hello world" << endl;

//   test1();
  unordered_Test1();
  return 0;
}